On Quantitative Software Verification
نویسنده
چکیده
ion • Very successful in (non-probabilistic) model checking − essential for verification of large/infinite-state systems • Construct abstract model A of concrete model M − details not relevant to some property of interest removed − e.g. partition of state space based on a set of predicates • Non-probabilistic case: existential abstraction − conservative: existence of path in M implies existence in A − hence can model check A to verify safety properties of M • Abstraction-refinement − automate process of constructing abstraction − information from model checking process can be used to refine the abstraction (or validate the property) − e.g. CEGAR (counterexample-guided abstraction refinement) check if counterexample is spurious and use to refine
منابع مشابه
Automated quantitative software verification
Many software systems exhibit probabilistic behaviour, either added explicitly, to improve performance or to break symmetry, or implicitly, through interaction with unreliable networks or faulty hardware. When employed in safety-critical applications, it is important to rigorously analyse the behaviour of these systems. This can be done with a formal verification technique called model checking...
متن کاملA Framework for Verification of Software with Time and Probabilities
Quantitative verification techniques are able to establish system properties such as “the probability of an airbag failing to deploy on demand” or “the expected time for a network protocol to successfully send a message packet”. In this paper, we describe a framework for quantitative verification of software that exhibits both real-time and probabilistic behaviour. The complexity of real softwa...
متن کاملAutomated Verification of Quantitative Properties of Cardiac Pacemaker Software
This poster paper reports on a model-based framework for software quality assurance for cardiac pacemakers developed in Simulink and described in [3]. A novel hybrid heart model is proposed that is suitable for quantitative verification of pacemakers. The heart model is formulated at the level of cardiac cells, can be adapted to patient data, and incorporates stochasticity. We validate the mode...
متن کاملQuantitative Analysis of Software: Challenges and Recent Advances
Even with impressive advances in formal methods over the last few decades, some problems in automatic verification remain challenging. Central amongst these is the verification of quantitative properties of software such as execution time or energy usage. This paper discusses the main challenges for quantitative analysis of software in cyber-physical systems. It also presents a new approach to ...
متن کاملQuantitative Verification in Practice
Soon after the birth of model checking, the first theoretical achievements have been reported on the automated verification of quantitative system aspects such as discrete probabilities and continuous time. These theories have been extended in various dimensions, such as continuous probabilities, cost constraints, discounting, hybrid phenomena, and combinations thereof. Due to unremitting impro...
متن کاملCollective Adaptive Systems: Qualitative and Quantitative Modelling and Analysis
This report documents the program and the outcomes of Dagstuhl Seminar 14512 “Collective Adaptive Systems: Qualitative and Quantitative Modelling and Analysis”. Besides presentations on current work in the area, the seminar focused on the following topics: (i) Modelling techniques and languages for collective adaptive systems based on the above formalisms. (ii) Verification of collective adapti...
متن کامل